Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques
نویسندگان
چکیده
منابع مشابه
Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested in errors that violate Mendelian laws. The problem of deciding if Mendelian error exists in a pedigree is NP-complete [1]. Existing tools dedicated to this problem may offer different level of services: detect simple ...
متن کاملLifting Techniques for Weighted Constraint Satisfaction Problems
In this paper, we identify rich tractable classes of Weighted Constraint Satisfaction Problems (WCSPs). Our results stem from employing a set of transformation techniques—referred to as “Lifting”—that considers each constraint locally. We show that, in general, WCSPs are reducible to minimum weighted vertex cover problems in tripartite graphs; and many tractable classes of WCSPs can be recogniz...
متن کاملAdaptation Using Constraint Satisfaction Techniques
Case adaptation, a central component of case-based reasoning, is often considered to be the most difficult part of a casebased reasoning system. The difficulties arise from the fact that adaptation often does not converge, especially if it is not done in a systematic way. This problem, sometimes termed the assimilation problem, is especially pronounced in the case-based design problem solving d...
متن کاملApproximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Constraint satisfaction problems (or CSPs) have been extensively studied in, for instance, artificial intelligence, database theory, graph theory, and statistical physics. From a practical viewpoint, it is beneficial to approximately solve CSPs. When one tries to approximate the total number of truth assignments that satisfy all Boolean constraints for (unweighted) Boolean CSPs, there is a know...
متن کاملInteractive Connguration Using Constraint Satisfaction Techniques
In this paper, we focus on techniques for incremental constraint-based conngu-ration with discrete and continuous variables. We show how to formalize constraint knowledge using compatibility and activity constraints (Mittal 1990) and how this knowledge is used for reasoning within an intelligent CAD system. Most technical (as opposed to spatial) constraint connguration systems use algorithms fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2008
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-007-9029-5